On counterexamples to the Hughes conjecture
نویسندگان
چکیده
In 1957 D.R. Hughes published the following problem in group theory. Let G be a group and p a prime. Define Hp(G) to be the subgroup of G generated by all the elements of G which do not have order p . Is the following conjecture true: either Hp(G) = 1, Hp(G) = G , or [G : Hp(G)] = p? This conjecture has become known as the Hughes conjecture. After various classes of groups were shown to satisfy the conjecture, G.E. Wall and E.I. Khukhro described counterexamples for p = 5, 7 and 11. Finite groups which do not satisfy the conjecture, antiHughes groups, have interesting properties. We give explicit constructions of a number of anti-Hughes groups via power-commutator presentations, including relatively small examples with orders 546 and 766 . It is expected that the conjecture is false for all primes larger than 3. We show that it is false for p = 13, 17 and 19.
منابع مشابه
On the connectivity of minimum and minimal counterexamples to Hadwiger's Conjecture
The main result of this paper is the following: Any minimal counterexample to Hadwiger’s Conjecture for the k-chromatic case is 2k 27 -connected. This improves the previous known bound due to Mader [W. Mader, Über trennende Eckenmengen in homomorphiekritischen Graphen, Math. Ann. 175 (1968) 243–252], which says that any minimal counterexample to Hadwiger’s Conjecture for the k-chromatic case is...
متن کاملCounterexamples to the Poset Conjectures of Neggers, Stanley, and Stembridge
We provide the first counterexamples to Neggers’ 1978 conjecture and Stembridge’s 1997 conjecture that the generating functions for descents and peaks in the linear extensions of naturally labeled posets should have all real zeros. We also provide minimum-sized counterexamples to a generalization of the Neggers conjecture due to Stanley that was recently disproved by Brändén.
متن کاملCounterexamples to Conjectures on Graphs with the Greatest Edge–Szeged Index
Recently, it was conjectured by Gutman and Ashrafi that the complete graph Kn has the greatest edge-Szeged index among simple graphs with n vertices. This conjecture turned out to be false, but led Vukičević to conjecture the coefficient 1/15552 of n6 for the approximate value of the greatest edge-Szeged index. We provide counterexamples to this conjecture.
متن کاملCounterexamples of the Conjecture on Roots of Ehrhart Polynomials
An outstanding conjecture on roots of Ehrhart polynomials says that all roots α of the Ehrhart polynomial of an integral convex polytope of dimension d satisfy −d ≤ R(α) ≤ d − 1. In this paper, we suggest some counterexamples of this conjecture.
متن کاملChaotic Polynomial Automorphisms; counterexamples to several conjectures
We give a polynomial counterexample to a discrete version of the Markus-Yamabe Conjecture and a conjecture of Deng, Meisters and Zampieri, asserting that if F : C → C is a polynomial map with det(JF ) ∈ C∗, then for all λ ∈ R large enough λF is global analytic linearizable. These counterexamples hold in any dimension ≥ 4.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009